Two Types of Algorithms for Finding the Cube Root in Finite Fields
نویسندگان
چکیده
منابع مشابه
Two Algorithms for Root Finding in
We present two algorithms for computing the root, or equivalently the xed point, of a function in exact real arithmetic. The rst algorithm uses the iteration of the expression tree representing the function in real arithmetic based on linear fractional transformations and exact oating point. The second and more general algorithm is based on a trisection of intervals and can be compared with the...
متن کاملCharacter Sums and Deterministic Polynomial Root Finding in Finite Fields
Let Fq be a finite field of q elements of characteristic p. The classical algorithm of Berlekamp [1] reduces the problem of factoring polynomials of degree n over Fq to the problem of factoring squarefree polynomials of degree n over Fp that fully split in Fp, see also [8, Chapter 14]. Shoup [15, Theorem 3.1] has given a deterministic algorithm that fully factors any polynomial of degree n over...
متن کاملNew Algorithms for Finding Irreducible Polynomials over Finite Fields
We present a new algorithm for finding an irreducible polynomial of specified degree over a finite field. Our algorithm is deterministic, and it runs in polynomial time for fields of small characteristic. We in fact prove the stronger result that the problem of finding irreducible polynomials of specified degree over a finite field is deterministic polynomial-time reducible to the problem of fa...
متن کاملstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
Irreducibility and Deterministic r-th Root Finding over Finite Fields
Constructing r -th nonresidue over a nite eld is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree r e (where r is a prime) over a given nite eld Fq of characteristic p (equivalently, constructing the bigger eld Fqr e ). Both these problems have famous randomized algorithms but the derandomization is an open question. We give some ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Korean Institute of Communications and Information Sciences
سال: 2016
ISSN: 1226-4717
DOI: 10.7840/kics.2016.41.5.499